k-gram Extensions of Terminal Distinguishable Languages
نویسنده
چکیده
We show how k-grams can be used to extend classes of terminal distinguishable right-linear languages (k-TDRL). Moreover, we present an efficient identification algorithm for k-TDRL languages. Our approach not only generalizes the class TDRL, but also the k-testable languages, as well as the k-reversible languages.
منابع مشابه
Some new extensions of Hardy`s inequality
In this study, by a non-negative homogeneous kernel k we prove some extensions of Hardy's inequalityin two and three dimensions
متن کاملUniversal Central Extension of Current Superalgebras
Representation as well as central extension are two of the most important concepts in the theory of Lie (super)algebras. Apart from the interest of mathematicians, the attention of physicist are also drawn to these two subjects because of the significant amount of their applications in Physics. In fact for physicists, the study of projective representations of Lie (super)algebras are very impo...
متن کاملIncremental Inference of a subclass of Even Linear Languages
Incremental inference of even linear languages in the limit from positive data is considered. Since it is known that the family of even linear languages is not inferable from positive data, we propose a subfamily of even linear languages which is inferable from positive data in polynomial time. We consider the family of Terminal Distinguishable Even Linear Languages(TDELL) for which an inferenc...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملExtensions of Some Fixed Point Theorems for Weak-Contraction Mappings in Partially Ordered Modular Metric Spaces
The purpose of this paper is to establish fixed point results for a single mapping in a partially ordered modular metric space, and to prove a common fixed point theorem for two self-maps satisfying some weak contractive inequalities.
متن کامل